Identifying news clusters using Q-analysis and Modularity

نویسنده

  • David Rodrigues
چکیده

With online publication and social media taking the main role in dissemination of news, and with the decline of traditional printed media, it has become necessary to devise ways to automatically extract meaningful information from the plethora of sources available and to make that information readily available to interested parties. In this paper we present a method of automated analysis of the underlying structure of online newspapers based on Q-analysis and modularity. We show how the combination of the two strategies allows for the identification of well defined news clusters that are free of noise (unrelated stories) and provide automated clustering of information on trending topics on news published online.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhance the Efficiency of Heuristic Algorithm for Maximizing Modularity Q

Modularity Q is an important function for identifying community structure in complex networks. In this paper, we prove that the modularity maximization problem maxS∈S Q̄ = Tr(S T BS) is equivalent to a nonconvex quadratic programming problem maxS∈S Qm = Tr(S T (B +D)S). This result provide us a simple way to improve the efficiency of heuristic algorithms for maximizing modularity Q. Many numeric...

متن کامل

Automatic clustering of multispectral imagery by maximization of the graph modularity

Automatic clustering of spectral image data is a common problem with a diverse set of desired and potential solutions. While typical clustering techniques use first order statistics and Gaussian models, the method described in this paper utilizes the spectral data structure to generate a graph representation of the image and then clusters the data by applying the method of optimal modularity fo...

متن کامل

Identifying base clusters and their application to maximizing modularity

Modularity maximization is an effective technique for identifying communities in networks that exhibit a natural division into tightly connected groups of vertices. However, not all networks possess a strong enough community structure to justify the use of modularity maximization. We introduce the concept of base clusters—that is group of vertices that form the kernel of each community and are ...

متن کامل

Mining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain

Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...

متن کامل

Supplemental methods for : Identifying robust communities and multi - community nodes by combining top - down and bottom - up approaches to clustering

clustering performance on real-world networks Traditionally, performance of clustering methods on networks with unknown correct clustering solutions is measured in terms of modularity (“Q”). Modularity measures the number of within-community connections, relative to the number expected at random. This measure has a maximum value of 1, but in practice maximum possible Q-value will be less than 1...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013